منابع مشابه
On a Graded Inclusion of Bipolar Fuzzy Relations
This paper deals with database fuzzy queries in the context where the fuzzy preference conditions involved are of a bipolar nature (the first pole corresponding to a constraint, the second to a wish). More precisely, we consider queries where an inclusion-based condition comes into play (a typical example being a division query). Due to the fact that bipolar fuzzy queries entail using a framewo...
متن کاملTopological Relations Between Bipolar Fuzzy Sets Based on Mathematical Morphology
In many domains of information processing, both vagueness, or imprecision, and bipolarity, encompassing positive and negative parts of information, are core features of the information to be modeled and processed. This led to the development of the concept of bipolar fuzzy sets, and of associated models and tools. Here we propose to extend these tools by defining algebraic relations between bip...
متن کاملBipolar general fuzzy automata
In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.
متن کاملSome Properties of Bipolar Fuzzy Cosets of a Bipolar Fuzzy and Bipolar Anti Fuzzy HX Subgroup
In this paper, we define the concept of a bipolar fuzzy cosets of a bipolar fuzzy HX subgroup, bipolar anti fuzzy HX subgroup, bipolar fuzzy middle coset of a bipolar fuzzy HX subgroup and bipolar anti fuzzy HX subgroup, conjugate bipolar fuzzy HX subgroup, conjugate bipolar anti fuzzy HX subgroup and discussed some of its properties with the examples. Further we define the level subsets and lo...
متن کاملNotes on bipolar concordance relations
Remark 1 In this text, we always work between 0 and 1 with 1/2 playing the rôle of the midpoint. A simple rescaling allows to work between −1 and 1 with 0 playing the rôle of a midpoint. • A valued relation T is said to be reflexive if T (x, x) = 1, for all x ∈ X. A valued relation T on X such that T (x, y) ∈ {0, 1}, for all x, y ∈ X, is said to be crisp. As is usual, we write x T y instead of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2019
ISSN: 2227-7390
DOI: 10.3390/math7111044